A rigorous proof of the Landauer–Büttiker formula

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A rigorous proof for the Landauer-Büttiker formula

Recently, Avron et al in [1],...,[5] shed new light on the question of quantum transport in mesoscopic samples coupled to particle reservoirs by semi-infinite leads. They rigorously treat the case when the sample undergoes an adiabatic evolution thus generating a current through the leads, and prove the so called BPT formula, see [9]. Using a discrete model, we complement their work by giving a...

متن کامل

Averaging of dilute random media: a rigorous proof of the Clausius-Mossotti formula

We consider a large number of randomly dispersed spherical, identical, inclusions in a bounded domain, with conductivity different than that of the host medium. In the dilute limit, with some mild assumption on the first few marginal probability densities (no periodicity or stationarity are assumed), we prove convergence in H norm of the expectation of the solution of the steady state heat equa...

متن کامل

A Rigorous Proof of the Inflationary Spectrum

Fundamental formulae representing the density perturbation spectrums generated in inflationary scenarios are rigorously proved. Quantum fluctuations as initial conditions for structure generation in some inflationary era can be calculated in general scale. Thus, we could avoid the matching of the large and the small scale results at the horizon crossing epoch. This is possible because the pertu...

متن کامل

A Rigorous Correctness Proof for Pastry

Peer-to-peer protocols for maintaining distributed hash tables, such as Pastry or Chord, have become popular for a class of Internet applications. While such protocols promise certain properties concerning correctness and performance, verification attempts using formal methods invariably discover border cases that violate some of those guarantees. Tianxiang Lu reported correctness problems in p...

متن کامل

A rigorous proof of the cavity method for counting matchings

In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important heuristic developed by statistical physicists that has lead to the development of faster distributed algorithms for problems in various combinatorial optimization problems. The validity of the approach has been supporte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Physics

سال: 2005

ISSN: 0022-2488,1089-7658

DOI: 10.1063/1.1862324